Complexity classes - PDFSEARCH.IO - Document Search Engine

Complexity classes
Results: 1120

#	Item
321	Syntactic Characterizations of Polynomial Time Optimization Classes Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2011-07-07 17:48:07 Computational problems Computational complexity theory Operations research Optimization problem Mathematical optimization Approximation algorithm NP Decision problem Polynomial-time approximation scheme Theoretical computer science Applied mathematics Complexity classes
322	Egon Borger Erich Gradel Yuri Gurevich The Classical Decision Problem Add to Reading List Source URL: www.gbv.de Language: English - Date: 2007-11-05 08:28:23 Computability theory Model theory Complexity classes Metalogic Proof theory Decision problem Decidability Satisfiability First-order logic Theoretical computer science Computational complexity theory Mathematical logic
323	Leveraging Belief Propagation, Backtrack Search, and Statistics for Model Counting Lukas Kroc, Ashish Sabharwal, Bart Selman Cornell University May 23, 2008 Add to Reading List Source URL: www.cs.cornell.edu Language: English - Date: 2009-02-12 00:13:50 Complexity classes Boolean algebra Constraint programming Mathematical optimization Boolean satisfiability problem Constraint satisfaction problem NP-complete Belief propagation NP Theoretical computer science Computational complexity theory Applied mathematics
324	A Multivariate Complexity Analysis of Lobbying in Multiple Referenda Robert Bredereck∗ , Jiehua Chen† , Sepp Hartung, Rolf Niedermeier and Ondˇrej Such´y‡ Stefan Kratsch Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2012-05-07 11:13:53 Complexity classes Parameterized complexity Mathematical optimization Matrix Kernelization NP Rank 2-satisfiability Theoretical computer science Computational complexity theory Applied mathematics
325	Resolving the Simultaneous Resettability Conjecture and a New Non-Black-Box Simulation Strategy Vipul Goyal∗ UCLA and MSR India Email: Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2009-10-23 06:25:21 IP Complexity classes Commitment scheme Soundness Challenge-response authentication NP Alice and Bob Black box Communications protocol Cryptography Cryptographic protocols Zero-knowledge proof
326	Monday, July 17 9:30-10:30 G¨ odel and Computations, Pavel Pudlak 10:30-11:00 Coffee 11:00-11:30 Polynomial Identity Testing for Depth 3 Circuits, Neeraj Kayal, Nitin Saxena Add to Reading List Source URL: computationalcomplexity.org Language: English - Date: 2012-07-28 21:08:59 Complexity classes Quantum complexity theory Russell Impagliazzo Circuit complexity PP PH Arthur–Merlin protocol Low Advice Theoretical computer science Computational complexity theory Applied mathematics
327	Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model∗ Andr´e Chailloux† Dragos Florin Ciocan‡ Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2007-12-13 07:18:22 Cryptographic protocols Complexity classes Zero-knowledge proof Interactive proof system Commitment scheme NP IP Soundness Entropy Theoretical computer science Cryptography Applied mathematics
328	Greens Crossing 1 ±103,884 SF AvailableGreens Crossing Blvd. \| Houston, TXwww.PintoBusinessPark.com Ed Bane, SIOR Add to Reading List Source URL: www.pintobusinesspark.com Language: English - Date: 2015-04-15 16:09:22 Transport Circuit complexity Complexity classes AC
329	Efficient Approximations of Conjunctive Queries Pablo Barcel´o1 1 Leonid Libkin2 Add to Reading List Source URL: homepages.inf.ed.ac.uk Language: English - Date: 2015-01-08 10:43:54 Tree decomposition Complexity classes Conjunctive query Graph homomorphism Hypergraph Hypercube graph Structure FO Graph theory Theoretical computer science Mathematics
330	Proofs that Yield All Languages Proof Add to Reading List Source URL: nakamotoinstitute.org Language: English - Date: 2014-03-23 11:48:58 Complexity classes Cryptographic protocols Probabilistic complexity theory Models of computation Interactive proof system Zero-knowledge proof NP IP Arthur–Merlin protocol Theoretical computer science Computational complexity theory Applied mathematics

UPDATE